An Adaptive Distance Vector Routing Algorithm for Mobile, Ad Hoc Networks
نویسندگان
چکیده
We present a new routing algorithm called Adaptive Distance Vector (ADV) for mobile, ad hoc networks (MANETs). ADV is a distance vector routing algorithm that exhibits some on-demand characteristics by varying the frequency and the size of the routing updates in response to the network load and mobility conditions. Using simulations we show that ADV outperforms AODV and DSR especially in high mobility cases by giving significantly higher (50% or more) peak throughputs and lower packet delays. Furthermore, ADV uses fewer routing and control overhead packets than that of AODV and DSR, especially at moderate to high loads. Our results indicate the benefits of combining both proactive and on-demand routing techniques in designing suitable routing protocols for MANETs.
منابع مشابه
Intuitionistic fuzzy logic for adaptive energy efficient routing in mobile ad-hoc networks
In recent years, mobile ad-hoc networks have been used widely due to advances in wireless technology. These networks are formed in any environment that is needed without a fixed infrastructure or centralized management. Mobile ad-hoc networks have some characteristics and advantages such as wireless medium access, multi-hop routing, low cost development, dynamic topology and etc. In these netwo...
متن کاملADAPTIVE ORDERED WEIGHTED AVERAGING FOR ANOMALY DETECTION IN CLUSTER-BASED MOBILE AD HOC NETWORKS
In this paper, an anomaly detection method in cluster-based mobile ad hoc networks with ad hoc on demand distance vector (AODV) routing protocol is proposed. In the method, the required features for describing the normal behavior of AODV are defined via step by step analysis of AODV and independent of any attack. In order to learn the normal behavior of AODV, a fuzzy averaging method is used fo...
متن کاملImproving Quality of Service Routing in Mobile Ad Hoc Networks Using OLSR
Mobile ad hoc networks (MANET) are constructed by mobile nodes without access point. Since MANET has certain constraints, including power shortages, an unstable wireless environment and node mobility, more power-efficient and reliable routing protocols are needed. The OLSR protocol is an optimization of the classical link state algorithm. OLSR introduces an interesting concept, the multipoint r...
متن کاملA Survey of Solutions to Protect Against All Types of Attacks in Mobile Ad Hoc Networks
In recent years mobile networks have expanded dramatically, compared with other wireless networks. Routing protocols in these networks are designed with the assumption that there is no attacker node, so routing protocols are vulnerable to various attacks in these networks. In this paper, we review the network layer attacks and then we simulate the impact of black hole attack on ad hoc on demand...
متن کاملPoint-to-point Routing Readings: Point-to-point Message Routing: (optional) Brad Karp's Powerpoint Slides on Multi-hop Wireless Networks Johnson, Maltz: Dynamic Source Routing (dsr) Hu, Johnson: Caching Strategies for On-demand Routing Protocols
Next time, we’ll continue with routing: Perkins, Royer: Ad hoc on-demand distance-vector routing (AODV) Chen, Murphy: Enabling disconnected transitive communication in mobile ad hoc networks Link-reversal algorithms: Gafni, Bertsekas: Distributed algorithms for generating loop-free routes in networks with frequently changing topology Park, Corson: A highly adaptive distributed routing algorithm...
متن کاملComparative Performance Analysis of AODV,DSR, TORA and OLSR Routing Protocols in MANET Using OPNET
Mobile Ad Hoc Networks (MANETs) are receiving a significant interest and are becoming very popular in the world of wireless networks and telecommunication. MANETs consist of mobile nodes which can communicate with each other without any infrastructure or centralized administration. In MANETs, the movement of nodes is unpredictable and complex; thus making the routing of the packets challenging....
متن کامل